منابع مشابه
Oriented star packings
Given a (possibly infinite) family S of oriented stars, an S-packing in a digraph D is a collection of vertex disjoint subgraphs of D, each isomorphic to a member of S. The S-PACKING problem asks for the maximum number of vertices, of a host digraph D, that can be covered by an S-packing of D. We prove a dichotomy for the decision version of the S-packing problem, giving an exact classification...
متن کاملLow Expansion Packings and Embeddings of Hypercubes into Star Graphs: A Performance-Oriented Approach
| We discuss the problem of packing hypercubes into an n-dimensional star graph S(n), which consists of embedding a disjoint union of hypercubes U into S(n) with load 1. Hypercubes in U have from bn=2c to (n + 1) blog 2 nc ? 2 blog 2 nc+1 + 2 dimensions, i.e. they can be as large as any hypercube which can be embedded with dilation at most 4 into S(n). We show that U can be embedded into S(n) w...
متن کاملTriangle packings and 1-factors in oriented graphs
An oriented graph is a directed graph which can be obtained from a simple undirected graph by orienting its edges. In this paper we show that any oriented graph G on n vertices with minimum indegree and outdegree at least (1/2 − o(1))n contains a packing of cyclic triangles covering all but at most 3 vertices. This almost answers a question of Cuckler and Yuster and is best possible, since for ...
متن کاملAttribute oriented induction with star schema
This paper will propose a novel star schema attribute induction as a new attribute induction paradigm and as improving from current attribute oriented induction. A novel star schema attribute induction will be examined with current attribute oriented induction based on characteristic rule and using non rule based concept hierarchy by implementing both of approaches. In novel star schema attribu...
متن کاملLeader election in oriented star graphs
Leader election in a network plays an important role in the area of distributed algorithm design. Structural properties of the network as well as presence of direction on the edges of the network greatly affects the complexity of the leader election problem which is primarily measure by the message complexity of the protocol. Our purpose in the present paper is to adapt the existing distributed...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Combinatorial Theory, Series B
سال: 2008
ISSN: 0095-8956
DOI: 10.1016/j.jctb.2007.09.004